Endpoint bounds for the non-isotropic Falconer distance problem associated with lattice-like sets
نویسنده
چکیده
Let S ⊂ R be contained in the unit ball. Let ∆(S) = {||a− b|| : a, b ∈ S}, the Euclidean distance set of S. Falconer conjectured that the ∆(S) has positive Lebesque measure if the Hausdorff dimension of S is greater than d 2 . He also produced an example, based on the integer lattice, showing that the exponent d 2 cannot be improved. In this paper we prove the Falconer distance conjecture for this class of sets based on the integer lattice. In dimensions four and higher we attain the endpoint by proving that the Lebesgue measure of the resulting distance set is still positive if the Hausdorff dimension of S equals d 2 . In three dimensions we are off by a logarithm. More generally, we consider K-distance sets ∆K(S) = {|a − b|K : a, b ∈ S}, where | · |K is the distance induced by a norm defined by a smooth symmetric convex body K whose boundary has everywhere nonvanishing Gaussian curvature. We prove that our endpoint result still holds in this setting, providing a further illustration of the role of curvature in this class of problems.
منابع مشابه
Non-isotropic Distance Measures for Lattice-generated Sets
Abstract We study distance measures for lattice-generated sets in R, d ≥ 3, with respect to non-isotropic distances | · | K , induced by smooth symmetric convex bodies K. An effective Fourier-analytic approach is developed to get sharp upper bounds for the second moment of the weighted distance measure. The implications of these estimates are discussed in the context of the general Erdös-Falcon...
متن کاملAverages over hyperplanes, sum-product theory in vector spaces over finite fields and the Erdős-Falconer distance conjecture
We prove a point-wise and average bound for the number of incidences between points and hyper-planes in vector spaces over finite fields. While our estimates are, in general, sharp, we observe an improvement for product sets and sets contained in a sphere. We use these incidence bounds to obtain significant improvements on the arithmetic problem of covering Fq, the finite field with q elements,...
متن کاملOn distance measures for well-distributed sets
In this paper we investigate the Erdös/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been classically used to study this problem. We conjecture that a majorant for the spherical means suffices to prove the distance conjecture(s) in this setting. For a ...
متن کاملOn Incomplete Distance Sets in Z p ⇥
In this paper we discuss the Erdős-Falconer distance problem. The classical Erdős distance problem in R, d 2, asks for the smallest possible size of (E) = {|x y| : x, y 2 E} with E ⇢ R a finite set. An analogous problem is the Falconer distance problem which asks how large does the Hausdor↵ dimension of a compact set E ⇢ R, d 2, needs to be to ensure that the Lebesgue measure of (E), defined as...
متن کاملNew distance and similarity measures for hesitant fuzzy soft sets
The hesitant fuzzy soft set (HFSS), as a combination of hesitant fuzzy and soft sets, is regarded as a useful tool for dealing with the uncertainty and ambiguity of real-world problems. In HFSSs, each element is defined in terms of several parameters with arbitrary membership degrees. In addition, distance and similarity measures are considered as the important tools in different areas such as ...
متن کامل